Convex comparison of service disciplines in real time queues

In this paper we present a comparison of the service disciplines in real-time queueing systems (the customers have a deadline before which they should enter the service booth). We state that the more a service discipline gives priority to customers having an early deadline, the least the average stationary lateness is. We show this result by comparing adequate random vectors with the Schur-Convex majorization ordering.